0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.34	% Computer   : n027.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 10:24:25 EDT 2021
0.12/0.34	% CPUTime    : 
0.12/0.35	% Number of cores: 8
0.12/0.35	% Python version: Python 3.6.8
0.19/0.35	# Version: 2.6rc1-ho
0.19/0.35	# No SInE strategy applied
0.19/0.35	# Trying AutoSched0 for 59 seconds
0.19/0.38	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04EN
0.19/0.38	# and selection function PSelectNewComplex.
0.19/0.38	#
0.19/0.38	# Preprocessing time       : 0.027 s
0.19/0.38	# Presaturation interreduction done
0.19/0.38	
0.19/0.38	# Proof found!
0.19/0.38	# SZS status Theorem
0.19/0.38	# SZS output start CNFRefutation
0.19/0.38	thf(cGRP_COMM, conjecture, ((((![X1:$i]:cP @ X1 @ e @ X1&![X2:$i, X1:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((cP @ X4 @ X3 @ X6<=>cPx @ X5 @ X6)<=(cP @ X1 @ X3 @ X5&cP @ X2 @ X1 @ X4)))&![X3:$i]:cP @ X3 @ X3 @ e)&![X2:$i]:cP @ e @ X2 @ X2)=>(cP @ b @ a @ ab<=cP @ a @ b @ ab)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cGRP_COMM)).
0.19/0.38	thf(c_0_1, negated_conjecture, ~(((((![X1:$i]:cP @ X1 @ e @ X1&![X2:$i, X1:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((cP @ X1 @ X3 @ X5&cP @ X2 @ X1 @ X4)=>(cP @ X4 @ X3 @ X6<=>cPx @ X5 @ X6)))&![X3:$i]:cP @ X3 @ X3 @ e)&![X2:$i]:cP @ e @ X2 @ X2)=>(cP @ a @ b @ ab=>cP @ b @ a @ ab))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cGRP_COMM])])).
0.19/0.38	thf(c_0_2, negated_conjecture, ![X16:$i, X17:$i, X18:$i, X19:$i, X20:$i, X21:$i, X22:$i, X23:$i, X24:$i]:((((cP @ X16 @ e @ X16&((~cP @ X20 @ X19 @ X22|cPx @ X21 @ X22|(~cP @ X18 @ X19 @ X21|~cP @ X17 @ X18 @ X20))&(~cPx @ X21 @ X22|cP @ X20 @ X19 @ X22|(~cP @ X18 @ X19 @ X21|~cP @ X17 @ X18 @ X20))))&cP @ X23 @ X23 @ e)&cP @ e @ X24 @ X24)&(cP @ a @ b @ ab&~cP @ b @ a @ ab)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
0.19/0.38	thf(c_0_3, negated_conjecture, ![X3:$i, X2:$i, X6:$i, X5:$i, X4:$i, X1:$i]:(cPx @ X4 @ X3|~cP @ X1 @ X2 @ X3|~cP @ X5 @ X2 @ X4|~cP @ X6 @ X5 @ X1), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_4, negated_conjecture, ![X1:$i]:cP @ X1 @ X1 @ e, inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_5, negated_conjecture, ![X2:$i, X1:$i, X4:$i, X6:$i, X5:$i, X3:$i]:(cP @ X3 @ X4 @ X2|~cPx @ X1 @ X2|~cP @ X5 @ X4 @ X1|~cP @ X6 @ X5 @ X3), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_6, negated_conjecture, cP @ a @ b @ ab, inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_7, negated_conjecture, ![X4:$i, X3:$i, X2:$i, X1:$i]:(cPx @ X1 @ X2|~cP @ e @ X3 @ X2|~cP @ X4 @ X3 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.19/0.38	thf(c_0_8, negated_conjecture, ![X1:$i]:cP @ e @ X1 @ X1, inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(cP @ ab @ X1 @ X2|~cP @ b @ X1 @ X3|~cPx @ X3 @ X2), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.19/0.38	thf(c_0_10, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(cPx @ X1 @ X2|~cP @ X3 @ X2 @ X1), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.19/0.38	thf(c_0_11, negated_conjecture, ![X1:$i]:(cP @ ab @ b @ X1|~cPx @ e @ X1), inference(spm,[status(thm)],[c_0_9, c_0_4])).
0.19/0.38	thf(c_0_12, negated_conjecture, ![X1:$i]:cPx @ e @ X1, inference(spm,[status(thm)],[c_0_10, c_0_4])).
0.19/0.38	thf(c_0_13, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:(cPx @ X1 @ X2|~cP @ X3 @ X4 @ X1|~cP @ X3 @ X4 @ X2), inference(spm,[status(thm)],[c_0_3, c_0_8])).
0.19/0.38	thf(c_0_14, negated_conjecture, ![X1:$i]:cP @ ab @ b @ X1, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])])).
0.19/0.38	thf(c_0_15, negated_conjecture, ![X1:$i, X2:$i]:cPx @ X1 @ X2, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_14])])).
0.19/0.38	thf(c_0_16, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i, X5:$i, X6:$i]:(cP @ X1 @ X2 @ X3|~cP @ X4 @ X5 @ X1|~cP @ X5 @ X2 @ X6), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_15])])).
0.19/0.38	thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i]:(cP @ X1 @ X2 @ X3|~cP @ X1 @ X2 @ X4), inference(spm,[status(thm)],[c_0_16, c_0_8])).
0.19/0.38	thf(c_0_18, negated_conjecture, ![X1:$i]:cP @ X1 @ e @ X1, inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_19, negated_conjecture, ![X1:$i, X2:$i]:cP @ X1 @ e @ X2, inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.19/0.38	thf(c_0_20, negated_conjecture, ![X1:$i, X2:$i]:cP @ e @ X1 @ X2, inference(spm,[status(thm)],[c_0_17, c_0_8])).
0.19/0.38	thf(c_0_21, negated_conjecture, ~cP @ b @ a @ ab, inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.38	thf(c_0_22, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:cP @ X1 @ X2 @ X3, inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_19]), c_0_20])])).
0.19/0.38	thf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22])]), ['proof']).
0.19/0.38	# SZS output end CNFRefutation
0.19/0.38	# Proof object total steps             : 24
0.19/0.38	# Proof object clause steps            : 21
0.19/0.38	# Proof object formula steps           : 3
0.19/0.38	# Proof object conjectures             : 24
0.19/0.38	# Proof object clause conjectures      : 21
0.19/0.38	# Proof object formula conjectures     : 3
0.19/0.38	# Proof object initial clauses used    : 7
0.19/0.38	# Proof object initial formulas used   : 1
0.19/0.38	# Proof object generating inferences   : 11
0.19/0.38	# Proof object simplifying inferences  : 10
0.19/0.38	# Training examples: 0 positive, 0 negative
0.19/0.38	# Parsed axioms                        : 7
0.19/0.38	# Removed by relevancy pruning/SinE    : 0
0.19/0.38	# Initial clauses                      : 13
0.19/0.38	# Removed in clause preprocessing      : 6
0.19/0.38	# Initial clauses in saturation        : 7
0.19/0.38	# Processed clauses                    : 48
0.19/0.38	# ...of these trivial                  : 2
0.19/0.38	# ...subsumed                          : 1
0.19/0.38	# ...remaining for further processing  : 45
0.19/0.38	# Other redundant clauses eliminated   : 0
0.19/0.38	# Clauses deleted for lack of memory   : 0
0.19/0.38	# Backward-subsumed                    : 10
0.19/0.38	# Backward-rewritten                   : 26
0.19/0.38	# Generated clauses                    : 68
0.19/0.38	# ...of the previous two non-trivial   : 51
0.19/0.38	# Contextual simplify-reflections      : 0
0.19/0.38	# Paramodulations                      : 68
0.19/0.38	# Factorizations                       : 0
0.19/0.38	# NegExts                              : 0
0.19/0.38	# Equation resolutions                 : 0
0.19/0.38	# Propositional unsat checks           : 0
0.19/0.38	#    Propositional check models        : 0
0.19/0.38	#    Propositional check unsatisfiable : 0
0.19/0.38	#    Propositional clauses             : 0
0.19/0.38	#    Propositional clauses after purity: 0
0.19/0.38	#    Propositional unsat core size     : 0
0.19/0.38	#    Propositional preprocessing time  : 0.000
0.19/0.38	#    Propositional encoding time       : 0.000
0.19/0.38	#    Propositional solver time         : 0.000
0.19/0.38	#    Success case prop preproc time    : 0.000
0.19/0.38	#    Success case prop encoding time   : 0.000
0.19/0.38	#    Success case prop solver time     : 0.000
0.19/0.38	# Current number of processed clauses  : 2
0.19/0.38	#    Positive orientable unit clauses  : 2
0.19/0.38	#    Positive unorientable unit clauses: 0
0.19/0.38	#    Negative unit clauses             : 0
0.19/0.38	#    Non-unit-clauses                  : 0
0.19/0.38	# Current number of unprocessed clauses: 10
0.19/0.38	# ...number of literals in the above   : 26
0.19/0.38	# Current number of archived formulas  : 0
0.19/0.38	# Current number of archived clauses   : 43
0.19/0.38	# Clause-clause subsumption calls (NU) : 49
0.19/0.38	# Rec. Clause-clause subsumption calls : 43
0.19/0.38	# Non-unit clause-clause subsumptions  : 2
0.19/0.38	# Unit Clause-clause subsumption calls : 19
0.19/0.38	# Rewrite failures with RHS unbound    : 0
0.19/0.38	# BW rewrite match attempts            : 68
0.19/0.38	# BW rewrite match successes           : 29
0.19/0.38	# Condensation attempts                : 0
0.19/0.38	# Condensation successes               : 0
0.19/0.38	# Termbank termtop insertions          : 1455
0.19/0.38	
0.19/0.38	# -------------------------------------------------
0.19/0.38	# User time                : 0.030 s
0.19/0.38	# System time              : 0.003 s
0.19/0.38	# Total time               : 0.033 s
0.19/0.38	# Maximum resident set size: 1636 pages
0.19/0.38	EOF